Optimal Limited Contingency Planning
نویسندگان
چکیده
For a given problem, the optimal Markov policy over a finite horizon is a conditional plan containing a potentially large number of branches. However, there are applications where it is desirable to strictly limit the number of decision points and branches in a plan. This raises the question of how one goes about finding optimal plans containing only a limited number of branches. In this paper, we present an any-time algorithm for optimal k-contingency planning. It is the first optimal algorithm for limited contingency planning that is not an explicit enumeration of possible contingent plans. By modelling the problem as a partially observable Markov decision process, it implements the Bellman optimality principle and prunes the solution space. We present experimental results of applying this algorithm to some simple test cases.
منابع مشابه
Automated Generation of Understandable Contingency Plans
Markov Decision Processes (MDPs) and contingency planning (CP) are two widely used approaches to planning under uncertainty. MDPs are attractive because the model is extremely general and because many algorithms exist for deriving optimal plans. In contrast, CP is normally performed using heuristic techniques that do not guarantee optimality, but the resulting plans are more compact and more un...
متن کاملPerspectives on aquatic animal disease contingency planning in the Asia-Pacific region.
The movement of live aquatic animals is one of the principal reasons for the rising number of disease emergencies in Asia and the Pacific. Contingency planning is crucial in the effective management of such emergencies. Within Asia, the Asia Regional Technical Guidelines on Health Management and the Responsible Movement of Live Aquatic Animals provide the basic framework for national and region...
متن کاملConcurrent Probabilistic Planning in the Graphplan Framework
We consider the problem of planning optimally in potentially concurrent probabilistic domains: actions have probabilistic effects and may execute in parallel under certain conditions; we seek a contingency plan that maximises the probability of reaching the goal. The Graphplan framework has proven to be highly successful at solving classical planning problems, but has not previously been applie...
متن کاملRobust contingency plans for transportation investment planning
A multistage decision process for transportation investment planning is described. Most transportation investment problems inherently involve multiple criteria and uncertainty. To deal with the variations arising from changes in external environments, robust contingency plans should be integrated in the planning process-not after plans are developed-to account for uncertainty. With the proposed...
متن کاملIntroduce an Optimal Pricing Strategy Using the Parameter of "Contingency Analysis" Neplan Software in the Power MarketCase Study (Azerbaijan Electricity Network)
Overall price optimization strategy in the deregulated electricity market is one of the most important challenges for the participants, In this paper, we used Contingency Analysis Module of NEPLAN Software, a strategy of pricing to market participants is depicted.Each of power plants according to their size and share of the Contingency Analysis should be considered in the price of its hour. In ...
متن کامل